Voting Paradoxes
نویسنده
چکیده
The early work of Condorcet in the 18th century, and that of Arrow and others in the 20th century, revealed the complex and interesting mathematical problems that arise in the theory of Social Choice, showing that the simple process of voting leads to strikingly counter-intuitive paradoxes. I will describe some of these, focusing on several recent intriguing examples whose analysis combines combinatorial and probabilistic ideas with techniques from the theory of the VC dimension of range spaces.
منابع مشابه
The likelihood of monotonicity paradoxes in run-off elections
A monotonicity paradox occurs when a voting system reacts in a perverse way to a change in individual opinions. The vulnerability of a voting system to monotonicity paradoxes is defined as the proportion of voting situations that can give rise to such paradoxes. In this paper we provide analytical representations of this vulnerability in the three-alternative case for two voting systems, i.e. p...
متن کاملAvoiding Paradoxes in Positional Voting Systems
It is well-known that no voting system can be entirely fair: this is Arrow’s Theorem, which states that under a certain natural definition of fairness, the only fair voting system is a dictatorship. Thus, in democratic political systems, one expects voting paradoxes in which different voting systems give different results. We analyze the mathematical basis of paradoxes amongst a certain class o...
متن کاملParadoxes of Multiple Elections: An Approximation Approach
When agents need to make decisions on multiple issues, applying common voting rules becomes computationally hard due to the exponentially large number of alternatives. One computationally efficient solution is to vote on the issues sequentially. In this paper, we investigate how well the winner under the sequential voting process approximates the winners under some common voting rules that admi...
متن کاملConnections and Implications of the Ostrogorski Paradox for Spatial Voting Models
The basic theme of this paper is to connect spatial voting concepts to the troubling Ostrogorski and Anscombe paradoxes (where a majority of the voters can be on the losing side over a majority of the issues). By doing so, answers to longstanding concerns are obtained; e.g., Kelly conjectured that an Ostrogorski paradox ensures that no candidate can be a Condorcet winner; we prove this is true ...
متن کاملStackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can be modeled as an extensive-form game of perfect information, which we call a Stackelberg voting game. We first propose a dynamic-programming algorithm for finding the backward-induction outcome for any Stackelberg vot...
متن کاملStackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can be modeled as an extensive-form game of perfect information, which we call a Stackelberg voting game. We first propose a dynamic-programming algorithm for finding the backward-induction outcome for any Stackelberg vot...
متن کامل